Performance metrics in the average consensus problem: A tutorial
نویسندگان
چکیده
منابع مشابه
Performance metrics in the average consensus problem: A tutorial
The average consensus algorithm is a distributed procedure which allows a network of agents to agree on the average of a set of initial values. The computation occurs through local exchange of information only, namely the information exchange takes place only between agents which are neighbors with respect to a graph representing the system communication architecture. Several performance metric...
متن کاملCommunication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of autonomous agents. In such a problem, communication constraints impose limits on the achievable control performance. We consider as instance of coordination the consensus problem. The aim of the paper is to characterize t...
متن کاملTutorial on dynamic average consensus: the problem, its applications, and the algorithms
This paper considers the problem of dynamic average consensus algorithm design for a group of communicating agents. This problem consists of designing a distributed algorithm that enables a group of agents with communication and computation capabilities to use local interactions to track the average of locally time-varying reference signals at each agent. The objective of this article is to pro...
متن کاملAverage-Consensus Algorithms in a Deterministic Framework
We consider the average-consensus problem in a multi-node network of finite size. Communication between nodes is modeled by a sequence of directed signals with arbitrary communication delays. Four distributed algorithms that achieve average-consensus are proposed. Necessary and sufficient communication conditions are given for each algorithm to achieve average-consensus. Resource costs for each...
متن کاملNonlinear Average Consensus
We present an algorithm for nonlinear consensus in complex networks. Our motivation draws from analysis on the algorithm based on a weighted linear update protocol. Comparison of the asymptotic with early convergence rate encourages an alternative algorithm which exploits both stages.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annual Reviews in Control
سال: 2012
ISSN: 1367-5788
DOI: 10.1016/j.arcontrol.2012.03.003